The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
نویسنده
چکیده
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via a sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity. Mathematics Subject Classification (2000) 94A55 · 94B05
منابع مشابه
Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N
The autocorrelation and the linear complexity of a key stream sequence in a stream cipher are important cryptographic properties. Many sequences with these good properties have interleaved structure, three classes of binary sequences of period 4N with optimal autocorrelation values have been constructed by Tang and Gong based on interleaving certain kinds of sequences of period N . In this pape...
متن کاملAbout the Linear Complexity of Binary Sequences with Optimal Autocorrelation Value/Magnitude and Length 4p
We derive the linear complexity and the minimal polynomial over the finite fields of order two and p of series of binary sequences with a period 4p and optimal autocorrelation value/magnitude. These sequences are constructed by cyclotomic classes of order two, four and six by methods proposed by K.T. Arasu et al. and Y. Sun et al. We define the parameters of sequences with optimal autocorrelati...
متن کاملThe 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been used in designing reliable stream ciphers. In this paper, we obtain the exact autocorrelation distribution of a class of sequence with three-level autocorrelation and analyze the 2-adic complexity of this sequence. Our results show that the 2-adic co...
متن کاملNew Quaternary Sequences with Ideal Autocorrelation Constructed from Legendre Sequences
In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the binary Legendre sequences of period p. For the new quaternary sequences, two properties which are considered as the major characteristics of pseudo-random sequences are derived. Firstly, the autocorrelation distribution of the proposed quaternary sequences ...
متن کاملThe evaluation of the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length 2p
In this article, we discuss a computation method for the linear complexity of generalized cyclotomic binary sequences of length 2p. This method allows to assess the linear complexity of above-mentioned sequences and to design the sequences with high linear complexity. Also we generalize known results about binary sequences of length 2p. In conclusion we evaluate the autocorrelation of generaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1708.05480 شماره
صفحات -
تاریخ انتشار 2017